The Natural Crossover for the D Euclidean TSP

For the traveling salesman problem vari ous search algorithms have been suggested for decades In the eld of genetic algo rithms many genetic operators have been in troduced for the problem Most genetic en coding schemes have some restrictions that cause more or less loss of information con tained in problem instances We suggest a new encoding crossover pair which pur sues minimal information loss in chromoso mal encoding and minimal restriction in re combination for the D Euclidean traveling salesman problem The most notable fea ture of the suggested crossover is that it is based on a totally new concept of encod ing We also prove the theoretical validity of the new crossover by an equivalence class analysis The proposed encoding crossover pair outperformed both distance preserving crossover and edge assembly crossover two state of the art crossovers in the literature